Non-interleaving bisimulation equivalences on Basic Parallel Processes
نویسندگان
چکیده
منابع مشابه
Non-interleaving bisimulation equivalences on Basic Parallel Processes
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n logn)) and history preserving bisimilarity (in O(n)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on this class....
متن کاملUndecidable Equivalences for Basic Parallel Processes
Article history: Received 10 December 2007 Revised 18 November 2008 Available online 31 January 2009 The trace equivalence of BPP was shown to be undecidable by Hirshfeld. We show that all the preorders and equivalences except bisimulation in Glabbeek’s linear time-branching time spectrum are undecidable for BPP. The results are obtained by extending Hirshfeld’s encoding ofMinskymachines into B...
متن کاملOn the Complexity of Bisimulation Problems for Basic Parallel Processes
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is co-NP-hard. Weak bisimilarity of BPP is not known to be decidable, but an NP lower bound has been shown in [31]. We improve this result by showing that weak bisi...
متن کاملWeak Bisimulation and Model Checking for Basic Parallel Processes
Basic Parallel Processes (BPP) are a natural subclass of CCS innnite-state processes. They are also equivalent to a special class of Petri nets. We show that unlike for general Petri nets, it is decidable if a BPP and a nite-state system are weakly bisimilar. To the best of our knowledge, this is the rst decidability result for weak bisimulation and a non-trivial class of innnite-state systems....
متن کاملNon-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is that Markovian bisimilarity is consistent with ordinary lumping. The latter is an aggregation for Markov chains that is exact, hence it guarantees the preservation of the performance characteristics across Markovian bisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.06.001